Downward Closure of Depth in Countable Boolean Algebras

نویسنده

  • ASHER M. KACH
چکیده

We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structural difference between the class of arbitrary rank countable Boolean algebras and the class of rank one countable Boolean algebras.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Proof of Completeness of S4 with Respect to the Real Line

It was proved in McKinsey and Tarski [7] that every finite wellconnected closure algebra is embedded into the closure algebra of the power set of the real line R. Pucket [10] extended this result to all finite connected closure algebras by showing that there exists an open map fromR to any finite connected topological space. We simplify his proof considerably by using the correspondence between...

متن کامل

The Completeness of the Isomorphism Relation for Countable Boolean Algebras

We show that the isomorphism relation for countable Boolean algebras is Borel complete, i.e., the isomorphism relation for arbitrary countable structures is Borel reducible to that for countable Boolean algebras. This implies that Ketonen’s classification of countable Boolean algebras is optimal in the sense that the kind of objects used for the complete invariants cannot be improved in an esse...

متن کامل

Characterizing the Computable Structures: Boolean Algebras and Linear Orders

A countable structure (with finite signature) is computable if its universe can be identified with ω in such a way as to make the relations and operations computable functions. In this thesis, I study which Boolean algebras and linear orders are computable. Making use of Ketonen invariants, I study the Boolean algebras of low Ketonen depth, both classically and effectively. Classically, I give ...

متن کامل

Extensions of Free Boolean Algebras

In a series of papers [2, 3, 4, 5], B. Efimov has given sufficient conditions for a Boolean algebra to have a free subalgebra of given cardinality. For example, he has shown that if an infinite Boolean algebra A has cardinality greater than exp exp exp v, but the supremum of the cardinalities of subsets of disjoint elements in A is not greater than v, then A has a free subalgebra with (exp v) i...

متن کامل

Topology Proceedings

This article deals with the coinitiality of topological spaces, a concept that generalizes the cofinality of a Boolean algebra as introduced by Sabine Koppelberg in [Boolean algebras as unions of chains of subalgebras, Algebra Universalis 7 (1977), no. 2, 195–203]. The compact spaces of countable coinitiality are characterized. This gives a new characterization of Boolean algebras of countable ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012